منابع مشابه
Hoptrees: Branching History Navigation for Hierarchies
Designing software for exploring hierarchical data sets is challenging because users can easily become lost in large hierarchies. We present a novel interface, the hoptree, to assist users with navigating large hierarchies. The hoptree preserves navigational history and context and allows one-click navigation to recently-visited locations. We describe the design of hoptrees and an implementatio...
متن کاملA variable depth search branching
We introduce a variable depth search branching, an extension to the local branching for solving Mixed-Integer Programs. Two strategies are assessed, a best improvement strategy and a first improvement strategy. The extensive computational assessment evidences a significant improvement over the local branching for both strategies.
متن کاملBoolean Hierarchies inside Dot–Depth One
Let B denote the class of languages having dot–depth , i.e., the class of languages that can we written as finite unions of languages u A u A un A un, where ui A and n . A language has dot–depth one if and only if it is in the Boolean closure of B . We examine the structure of the class of dot–depth one languages with respect to Boolean operations and identify an infinite family of Boolean hier...
متن کاملTwo infinite hierarchies of languages defined by branching grammars
Two types of branching grammars are introduced inspired from Havel's works about branching automata. They naturally define two infinite hierarchies into the family of regular, respectively, linear languages. Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained. Finally, the relations between branching grammars and contextual grammars of [5] ...
متن کاملCounting Hierarchies: Polynomial Time and Constant Depth Circuits
In the spring of 1989, Seinosuke Toda of the University of Electro-Communications in Tokyo, Japan, proved that the polynomial hierarchy is contained in P PP To-89]. In this Structural Complexity Column, we will brieey review Toda's result, and explore how it relates to other topics of interest in computer science. In particular, we will introduce the reader to The Counting Hierarchy: a hierarch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2003
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)82504-6